Self-dual codes over rings and the Chinese remainder theorem

MDS and self-dual codes over rings

In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the construction of infinite families of MDS self-dual codes over finite chain rings, formal power series and principal ideal rings.

Self-dual codes over commutative Frobenius rings

We prove that self-dual codes exist over all finite commutative Frobenius rings, via their decomposition by the Chinese Remainder Theorem into local rings. We construct non-free self-dual codes under some conditions, using self-dual codes over finite fields, and we also construct free self-dual codes by lifting elements from the base finite field. We generalize the building-up construction for ...

Extension theorems for self-dual codes over rings and new binary self-dual codes

In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F2m + uF2m for m = 1, 2. The duality and distance preserving Gray maps from F4 + uF4 to (F2 + uF2) and F42 are used to obtain self-dual codes whose binary Gray images are [64, 32, 12]-extremal self-dual. An F2 + uF2-exten...

Various constructions for self-dual codes over rings and new binary self-dual codes

In this work, we propose a modified four circulant construction for self-dual codes and a bordered version of the construction using the properties of λ-circulant and λ-reverse circulant matrices. By using the constructions on F2, we obtain new binary codes of lengths 64 and 68. We also apply the constructions to the ring R2 and considering the F2 and R1-extensions, we obtain new singly-even ex...

The Chinese Remainder Theorem